Multicore Curve-Based Cryptoprocessor with Reconfigurable Modular Arithmetic Logic Units over GF(2^n)
نویسندگان
چکیده
منابع مشابه
Reconfigurable and resettable arithmetic logic units based on magnetic beads and DNA.
Based on the characteristics of magnetic beads and DNA, a simple and universal platform was developed for the integration of multiple logic gates to achieve resettable half adder and half subtractor functions. The signal reporter was composed of a split G-quadruplex DNAzyme and AuNP-surface immobilized molecular beacon molecule. The novel feature of the designed system is that the inputs (split...
متن کاملInternational Journal of Electronics Reconfigurable Modular Arithmetic Logic Unit Supporting High-performance Rsa and Ecc over Gf( P) Reconfigurable Modular Arithmetic Logic Unit Supporting High-performance Rsa and Ecc over Gf( P)
This article maybe used for research, teaching and private study purposes. Any substantial or systematic reproduction, redistribution , reselling , loan or sub-licensing, systematic supply or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to dat...
متن کاملElliptic Curve Cryptoprocessor with Hierarchical Security
This paper describes an elliptic curve scalar multiplication method which is resistant to power analysis attacks. The proposed method confuses both the private key bit values and positions. Even with correct leaked information on the type of operations performed, associating that with a particular key bit value or position is almost impossible. Resistance to side channel attacks is provided at ...
متن کاملOrders of Units in Modular Arithmetic
If a mod m is a unit then aφ(m) ≡ 1 mod m by Euler’s theorem. (When m = p is prime, then this becomes ap−1 ≡ 1 mod p for a 6≡ 0 mod p, which is Fermat’s little theorem.) Depending on a, it might happen that an ≡ 1 mod m for an n that is smaller than φ(m). Example 1.1. Take m = 11. Then a10 ≡ 1 mod 11 for all a 6≡ 0 mod 11. When a = 2 no exponent smaller than 10 works, but when a = 3 we can use ...
متن کاملReconfigurable Modular Arithmetic Logic Unit for High-Performance Public-Key Cryptosystems
This paper presents a reconfigurable hardware architecture for Public-key cryptosystems. By changing the connections of coarse grain Carry-Save Adders (CSAs), the datapath provides a high performance for both RSA and Elliptic Curve Cryptography (ECC). In addition, we introduce another reconfigurability for the flip-flops in order to make the best of hardware resources. The results of FPGA imple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2007
ISSN: 0018-9340
DOI: 10.1109/tc.2007.1071